Speeding up many-objective optimization by Monte Carlo approximations
نویسندگان
چکیده
منابع مشابه
Speeding up many-objective optimization by Monte Carlo approximations
Many state-of-the-art evolutionary vector optimization algorithms compute the contributing hypervolume for ranking candidate solutions. However, with an increasing number of objectives, calculating the volumes becomes intractable. Therefore, although hypervolume-based algorithms are often the method of choice for bi-criteria optimization, they are regarded as not suitable for manyobjective opti...
متن کاملSpeeding up the Hybrid-Monte-Carlo algorithm for dynamical fermions
In large scale simulations of lattice QCD with two flavours of mass-degenerate Wilson fermions, the mass of the fermions is still too large compared with the up and the down quark masses. Therefore a delicate extrapolation of the data is needed. Unfortunately, the numerical effort required for the Hybrid-Monte-Carlo (HMC) [1] algorithm increases as the quark mass decreases for, at least, three ...
متن کاملSpeeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization
We give faster approximation algorithms for the generalization of two NP-hard spanning tree problems. First, we investigate the problem of minimizing the degree of minimum spanning forests. Fischer [4] has shown how to compute a minimum spanning tree of degree at most b · ∆ + dlogb ne in time O(n 4+1/ ln ) for any b > 1, where ∆ is the value of an optimal solution. We model our generalization a...
متن کاملParallel Speed-Up of Monte Carlo Methods for Global Optimization
Introduction In this article we will be concerned with the optimization of a scalar-valued function u = f(x), x ∈ D, defined on some set D. Often D is a subset of n-dimensional Euclidean space R. Further we impose the condition that D be a finite set although we do not restrict the size of its cardinality. Thus D might be the set of all n-tuples of computer floating point numbers. In this way o...
متن کاملMonte Carlo approximations of the Neumann problem
We introduce Monte Carlo methods to compute the solution of elliptic equations with pure Neumann boundary conditions. We first prove that the solution obtained by the stochastic representation has a zero mean value with respect to the invariant measure of the stochastic process associated to the equation. Pointwise approximations are computed by means of standard and new simulation schemes espe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2013
ISSN: 0004-3702
DOI: 10.1016/j.artint.2013.08.001